Globally Consistent Space-Time Reconstruction
نویسندگان
چکیده
Most objects deform gradually over time, without abrupt changes in geometry or topology, such as changes in genus. Correct space-time reconstruction of such objects should satisfy this gradual change prior. This requirement necessitates a globally consistent interpretation of spatial adjacency. Consider the capture of a surface that comes in contact with itself during the deformation process, such as a hand with different fingers touching one another in parts of the sequence. Naive reconstruction would glue the contact regions together for the duration of each contact and keep them apart in other parts of the sequence. However such reconstruction violates the gradual change prior as it enforces a drastic intrinsic change in the object’s geometry at the transition between the glued and unglued sub-sequences. Instead consistent global reconstruction should keep the surfaces separate throughout the entire sequence. We introduce a new method for globally consistent space-time geometry and motion reconstruction from video capture. We use the gradual change prior to resolve inconsistencies and faithfully reconstruct the geometry and motion of the scanned objects. In contrast to most previous methods our algorithm doesn’t require a strong shape prior such as a template and provides better results than other template-free approaches.
منابع مشابه
Efficient Online Surface Correction for Real-time Large-Scale 3D Reconstruction
State-of-the-art methods for large-scale 3D reconstruction from RGB-D sensors usually reduce drift in camera tracking by globally optimizing the estimated camera poses in real-time without simultaneously updating the reconstructed surface on pose changes. We propose an efficient on-the-fly surface correction method for globally consistent dense 3D reconstruction of large-scale scenes. Our appro...
متن کاملSolving Non-binary Convez CSPs in Continous Domains
A globally consistent labeling is a compact representation of the complete solution space for a constraint satisfaction problem (CSP). Constraint satisfaction is NP-complete and so is the construction of globally consistent labelings for general problems. However, for binary constraints , it is known that when constraints are convex, path-consistency is suucient to ensure global consistency and...
متن کاملNecessary and sufficient conditions for consistent root reconstruction in Markov models on trees
We establish necessary and sufficient conditions for consistent root reconstruction in continuous-time Markov models with countable state space on bounded-height trees. Here a root state estimator is said to be consistent if the probability that it returns to the true root state converges to 1 as the number of leaves tends to infinity. We also derive quantitative bounds on the error of reconstr...
متن کاملRobust and Globally-Consistent 3D Reconstruction for Acquisition and Registration
3D reconstructions from photographs often exhibit poor robustness and global consistency. This is a problem in applications such as model acquisition and registration where global consistency is needed to ensure that the reconstruction looks acceptable from all views. Our goal is to develop a robust reconstruction approach which leads to better consistency between viewpoints. We do this by solv...
متن کاملReconstruction of Data Gaps in Total-Ozone Records with a New Wavelet Technique
This study introduces a new technique to fill and reconstruct daily observational of Total Ozone records containing void data for some days based on the wavelet theory as a linear time-frequency transformation, which has been considered in various fields of science, especially in the earth and space physics and observational data processing related to the Earth and space sciences. The initial c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 29 شماره
صفحات -
تاریخ انتشار 2010